A novel approach for the global localization problem
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولA Novel Intelligent Water Drops Optimization Approach for Estimating Global Solar Radiation
Normal 0 false false false EN-US X-NONE AR-SA MicrosoftInternetExplorer4 Measurement of solar radiance demands expensive devices to be used. Alternatively, estimator models are used instead. In this paper, a new method based on the empirical equations is introduced to estimate the monthly average daily global solar radiation on a horizontal surface. The proposed method uses Intelligent Water ...
متن کاملA Novel Approach for Optimization of Transportation Problem in Chaos Environment
Nature is characterized by its chaotic behavior. Mathematics is considered one of the appropriate tools to achieve the best definition of possible its chaos variables and process. Classical mathematics deals with the numbers as static and meaningless, but chaos mathematics deals with it as dynamic evolutionary, and value- added. This paper attempts to introduce the transportation problem re...
متن کاملA Local Branching Approach for the Set Covering Problem
The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is te...
متن کاملA genetic algorithm approach for problem
In this paper, a genetic algorithm is presented for an identical parallel-machine scheduling problem with family setup time that minimizes the total weighted flow time ( ). No set-up is necessary between jobs belonging to the same family. A set-up must be scheduled when switching from the processing of family i jobs to those of another family j, i j, the duration of this set-up being the sequ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Universitaria
سال: 2012
ISSN: 2007-9621,0188-6266
DOI: 10.15174/au.2012.349